Minimal Binary Abelian Codes of length pq
نویسندگان
چکیده
We consider binary abelian codes of length pq where p and q are prime rational integers under some restrictive hypotheses. In this case, we determine the idempotents generating minimal codes and either the respective weights or bounds of these weights. We give examples showing that these bounds are attained in some cases.
منابع مشابه
Minimal Binary Abelian Codes of length $p^m q^n$
We consider binary abelian codes of length pq where p and q are prime rational integers under some restrictive hypotheses. In this case, we determine the idempotents generating minimal codes and either the respective weights or bounds of these weights. We give examples showing that these bounds are attained in some cases.
متن کاملIdempotents in group algebras and minimal abelian codes
We compute the number of simple components of a semisimple finite abelian group algebra and determine all cases where this number is minimal; i.e. equal to the number of simple components of the rational group algebra of the same group. This result is used to compute idempotent generators of minimal abelian codes, extending results of Arora and Pruthi [S.K. Arora, M. Pruthi, Minimal cyclic code...
متن کاملDyck Words, Lattice Paths, and Abelian Borders
We use results on Dyck words and lattice paths to derive a formula for the exact number of binary words of a given length with a given minimal abelian border length, tightening a bound on that number from Christodoulakis et al. (Discrete Applied Mathematics, 2014). We also extend to any number of distinct abelian borders a result of Rampersad et al. (Developments in Language Theory, 2013) on th...
متن کاملQuantum Error-Correction Codes on Abelian Groups
We prove a general form of bit flip formula for the quantum Fourier transform on finite abelian groups and use it to encode some general CSS codes on these groups.
متن کاملProof of tightness of Varshamov - Gilbert bound for binary codes
We prove tightness of Varshamov Gilbert (VG) bound for binary codes Subset C ⊂ 2 such that Hamming distance dH(x, y) ≥ d, x 6= y ∈ C we call binary code with minimal distance d. The main Problem in Information Theory is to determine the asymptotic of the rate R(d = [δn]) = (log2 |C|)/n, δ ∈ (0, 1/2). Famous asymptotic lower bound is Varshamov Gilbert bound [3], [4] which was established in 50th...
متن کامل